منابع مشابه
Brick: Mining Pedagogically Interesting Sequential Patterns
One of the goals of the SCY project (www.scy-net.eu) is to make (inquiry) learning environments adaptive. The idea is to develop “pedagogical agents” that monitor learner behaviour through the actions they perform and identify patterns that point to systematic behaviour, or lack thereof. To achieve these aims, it is necessary to develop methods to identify relevant patterns, and to associate th...
متن کاملK3 Surfaces with Interesting Groups of Automorphisms
By the fundamental result of I.I. Piatetsky-Shapiro and I.R. Shafarevich (1971), the automorphism group Aut(X) of a K3 surface X over C and its action on the Picard lattice SX are prescribed by the Picard lattice SX . We use this result and our method (1980) to show finiteness of the set of Picard lattices SX of rank ≥ 3 such that the automorphism group Aut(X) of the K3 surface X has a non-triv...
متن کاملAn Efficient Data Mining Technique for Discovering Interesting Sequential Patterns
Mining sequential patterns is to discover sequential purchasing behaviors of most customers from a large amount of customer transactions. In this paper, a data mining language is presented. From the data mining language, users can specify the interested items and the criteria of the sequential patterns to be discovered. Also, an efficient data mining technique is proposed to extract the sequent...
متن کاملMicrovessel haemodynamics: interesting news which is not NO news?
Visceral obesity, a key factor of the metabolic syndrome and clinically to be recognized as an ‘apple-shape’ habitus and an increased waist circumference, is a strong predictor of cardiovascular events. There is a staggering increase in the prevalence of obesity in westernized societies in conjunction with an increase in type 2 diabetes and (sub)clinical atherosclerosis. From a clinical point o...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2017
ISSN: 0166-8641
DOI: 10.1016/j.topol.2017.06.001